Substitutions over infinite alphabet generating (-\beta)-integers
نویسنده
چکیده
This contribution is devoted to the study of positional numeration systems with negative base introduced by Ito and Sadahiro in 2009, called (−β )-expansions. We give an admissibility criterion for more general case of (−β )-expansions and discuss the properties of the set of (−β )-integers, denoted by Z−β . We give a description of distances within Z−β and show that this set can be coded by an infinite word over an infinite alphabet, which is a fixed point of a non-erasing non-trivial morphism.
منابع مشابه
Substitutions over Infinite Alphabet Generating (-β)-Integers
This contribution is devoted to the study of positional numeration systems with negative base introduced by Ito and Sadahiro in 2009, called (−β )-expansions. We give an admissibility criterion for more general case of (−β )-expansions and discuss the properties of the set of (−β )-integers, denoted by Z−β . We give a description of distances within Z−β and show that this set can be coded by an...
متن کاملLambda Words: A Class of Rich Words Defined Over an Infinite Alphabet
Lambda words are sequences obtained by encoding the differences between ordered elements of the form i + jθ, where i and j are non-negative integers and 1 < θ < 2. Lambda words are right-infinite words defined over an infinite alphabet that have connections with Sturmian words, Christoffel words, and interspersion arrays. We show that Lambda words are infinite rich words. Furthermore, any Lambd...
متن کاملOn the Delone property of (-\beta)-integers
These sets were introduced in the domain of quasicrystallography, see e.g. [2]. It is not difficult to see that Z−β =Z when β ∈Z, and that Z−β = {0} when β < 1+ √ 5 2 . For β ≥ 1+ √ 5 2 , Ambrož et al. [1] showed that Z−β can be described by the fixed point of an anti-morphism on a possibly infinite alphabet. They also calculated explicitely the set of distances between consecutive (−β )-intege...
متن کاملMaximal pattern complexity for discrete systems
For an infinite word α = α0α1α2 · · · over a finite alphabet, Kamae introduced a new notion of complexity called maximal pattern complexity defined by pα(k) := sup τ ]{αn+τ(0)αn+τ(1) · · ·αn+τ(k−1); n = 0, 1, 2, · · · } where the supremum is taken over all sequences of integers 0 = τ(0) < τ(1) < · · · < τ(k − 1) of length k. Kamae proved that α is aperiodic if and only if pα(k) ≥ 2k for every k...
متن کاملOn stabilizers of infinite words
The stabilizer of an infinite word w over a finite alphabet Σ is the monoid of morphisms over Σ that fix w. In this paper we study various problems related to stabilizers and their generators. We show that over a binary alphabet, there exist stabilizers with at least n generators for all n. Over a ternary alphabet, the monoid of morphisms generating a given infinite word by iteration can be inf...
متن کامل